Realization of Degree 10 Minimum Spanning Trees in 3-Space
نویسنده
چکیده
We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.
منابع مشابه
Degree sequence realizations with given packing and covering of spanning trees
Designing networks in which every processor has a given number of connections often leads to graphic degree sequence realization models. A nonincreasing sequence d = (d1, d2, . . . , dn) is graphic if there is a simple graphGwith degree sequence d. The spanning tree packing number of graphG, denoted by τ(G), is themaximumnumber of edge-disjoint spanning trees in G. The arboricity of graph G, de...
متن کاملOn the Area Requirements of Euclidean Minimum Spanning Trees
In their seminal paper on Euclidean minimum spanning trees [Discrete & Computational Geometry, 1992], Monma and Suri proved that any tree of maximum degree 5 admits a planar embedding as a Euclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; however, the authors conjectured that c × c area is sometimes required to embed an n-vertex tree of maximum degree...
متن کاملExternal Memory Minimum Spanning Trees
While in the last years much theoretical work about external memory minimum spanning trees was done, the practical realization of the designed algorithms was neglected. It is the goal of my Bachelor thesis to fill this gap, i.e., we will show that the computation of minimum spanning trees of very large graphs is possible efficiently not only in theory but also in practice.
متن کاملPolynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction
Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical noderegister state model, with a weakly fair scheduler, and we present a space-optimal silent self-stabilizing construction of minimum-degree spanning trees in this model. Computing a spanning tree with minimum degree is NP...
متن کاملA distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer [3] has shown how to compute a minimum weight spanning tree of degree at most b∆∗ + ⌈logb n⌉ in time O(n 4+1/ln ) for any constant b > 1, where ∆∗ is the value of an optimal solution and n is the number of nodes in the network. In this paper, we propose a distributed version of Fischer’s algorithm that requires messages and time complexity O(n ), and O(n) space per node.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006